Efficient processing of proximity based spatial queries
نویسنده
چکیده
Spatial databases play a vital role in many applications such as Geographic Information Systems (GIS), Computer Aided Design (CAD), Very-Large-Scale Integration (VLSI) designs, Multimedia Information System (MMIS), and medicine and biological research. Due to their importance, a large body of work has focused on efficiently computing various spatial queries. A proximity based spatial query computes the results based on the proximity (closeness) between the objects. Range queries, reverse k nearest neighbors (RkNN) queries and k-closest pairs queries are some of the most important and well studied proximity based spatial queries. In this thesis, we provide efficient solutions for these queries under various settings. Below is a brief description of our contributions. We present several algorithms to answer RkNN queries under different settings. More specifically, we present an approach, called Lazy Updates, to continuously monitor RkNN queries in Euclidean space as well as in spatial networks. Lazy Updates outperforms all of the existing techniques in terms of both the computation cost and the communication cost. We devise another technique, based on a novel concept of influence zone, to efficiently compute both snapshot and continuous RkNN queries. The influence zone based approach outperforms the existing techniques for both the snapshot and the continuous RkNN queries. We also provide efficient solution for probabilistic RNN queries for the case when the underlying data is uncertain. We are the first to study the efficient monitoring of moving range queries over a set of static data objects in Euclidean space and in spatial networks. We conduct a rigorous theoretical analysis to show the effectiveness of our approach. The theoretical results are verified by an extensive experimental study. The experimental results also demonstrate that the proposed approach is close to optimal. We are the first to present a unified framework to answer a broad class of top-k pairs queries including the k-closest pairs queries, k-furthest pairs queries and their bichromatic variants. We conduct a rigorous complexity analysis and show that the expected cost of our proposed algorithms is optimal when the scoring function uses at most two attributes.
منابع مشابه
Monitoring Cost Reduction in Sensor Networks using Proximity Queries
Event detection and notification is a common task in a Wireless Sensor Networks (WSN). Efficient data aggregation and the minimization of energy consumption are the great research challenges in WSN. In WSN, normally the events are detected by more than one node and it is more reliable if the consistent event information is received from more than one node. Therefore, aggregated event informatio...
متن کاملProximity Cluster Trees
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as intersection and containment testing, on large data sets. Set-up time and complexity of these structures can limit their value for small data sets, an often overlooked yet important category in geometric processing. We pres...
متن کاملDeveloping a BIM-based Spatial Ontology for Semantic Querying of 3D Property Information
With the growing dominance of complex and multi-level urban structures, current cadastral systems, which are often developed based on 2D representations, are not capable of providing unambiguous spatial information about urban properties. Therefore, the concept of 3D cadastre is proposed to support 3D digital representation of land and properties and facilitate the communication of legal owners...
متن کاملEfficient Processing of Top-k Spatial Keyword Queries
Given a spatial location and a set of keywords, a top-k spatial keyword query returns the k best spatio-textual objects ranked according to their proximity to the query location and relevance to the query keywords. There are many applications handling huge amounts of geotagged data, such as Twitter and Flickr, that can benefit from this query. Unfortunately, the state-of-the-art approaches requ...
متن کاملEfficient Trajectory Cover Search for Moving Object Trajectories
Given a set of query locations and a set of query keywords, a Trajectory Cover (CT) query over a repository of mobile trajectories returns a minimal set of trajectories that maximally covers the query keywords and are also spatially close to the query locations. Processing CT queries over mobile trajectories requires substantially different algorithms than those for location range queries. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011